On a Combinatorial Problem of Erdös and Hajnal
نویسندگان
چکیده
منابع مشابه
The Erdös-Hajnal Conjecture - A Survey
The Erdös-Hajnal conjecture states that for every graph H, there exists a constant δ(H) > 0 such that every graph G with no induced subgraph isomorphic to H has either a clique or a stable set of size at least |V (G)|. This paper is a survey of some of the known results on this conjecture.
متن کاملOn a problem of Erdös and Graham
In this paper we provide bounds for the size of the solutions of the Diophantine equation x(x+ 1)(x+ 2)(x+ 3)(x+ k)(x+ k+ 1)(x+ k+ 2)(x+ k+ 3) = y, where 4 ≤ k ∈ N is a parameter. We also determine all integral solutions for 1 ≤ k ≤ 10.
متن کاملProof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
A topological complete graph of order p comprises p vertices {v1, . . . , vp} and (p 2 ) pairwise vertex disjoint paths Pi, j , 1 ≤ i < j ≤ p, such that Pi, j joins vi to v j . It was conjectured by Mader [11], and also by Erdös and Hajnal [6], that there is a positive constant c such that any graph G of size at least cp2|G| contains a topological complete subgraph of order p. It was pointed ou...
متن کاملUpper Bounds for Erdös-Hajnal Coefficients of Tournaments
A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of ord...
متن کاملErdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension
The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VCdimension of the set system induced by the neighborhoods of its vertices. We show that every n-vertex graph with bounded VC-dimension contains a clique or an independent set of size at least e(logn) . The dependence on the VC-dimension is hidden in the o(1) term. This improves the general lower bound, e √ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 1964
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-1964-016-9